Search results for "leader election"
showing 3 items of 3 documents
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Secure random number generation in wireless sensor networks
2011
The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverseapplications, ranging from environmental monitoring to home automation, has raised more and more atten-tion to the issues related to the design of specifically customized security mechanisms. The scarcity ofcomputational, storage, and bandwidth resources cannot definitely be disregarded in such context, and thismakes the implementation of security algorithms particularly challenging. This paper proposes a securityframework for the generation of true random numbers, which are paramount as the core building blockfor many security algorithms; the intrinsic nature of wireless sensor nodes …
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…